Research on Group Reverse Farthest Neighbour Query Algorithm
نویسندگان
چکیده
منابع مشابه
Chase Your Farthest Neighbour: A simple gathering algorithm for anonymous, oblivious and non-communicating agents
We consider a group of mobile robotic agents, identical and indistinguishable, having no memory (oblivious) and no common frame of reference (neither absolute location nor a common orientation). Furthermore, these agents are assumed to posses only rudimentary sensing and computational capabilities (limited visibility and basic geometric sorting). We prove that, such robots, implementing a ”Chas...
متن کاملResearch on Hybrid Query Expansion Algorithm
This paper proposes a hybrid query expansion method named GAO, which derives from the fact that more and more documents have been annotated with one or several ontology concepts based on their semantic. The GAO method employs a combination of global analysis and ontology technology to improve query expansion performance. The global analysis technology is used to obtain term-concept association,...
متن کاملReverse k-Ranks Query
Finding matching customers for a given product based on individual user’s preference is critical for many applications, especially in e-commerce. Recently, the reverse top-k query is proposed to return a number of customers who regard a given product as one of the k most favorite products based on a linear model. Although a few “hot” products can be returned to some customers via reverse top-k ...
متن کاملAn Efficient Data Dissemination Scheme for Nearest Neighbour Query Processing
Location dependent information services (LDISs) produce answers to queries according to the location of the client issuing the query. In LDIS, techniques such as caching, prefetching and broadcasting are effective approaches to reducing the wireless bandwidth requirement and query response time. However, the client’s mobility may lead to inconsistency problems. In this paper, we introduce the b...
متن کاملRNN (Reverse Nearest Neighbour) in Unproven Reserve Based Outlier Discovery
Outlier detection refers to task of identifying patterns. They don’t conform establish regular behavior. Outlier detection in highdimensional data presents various challenges resulting from the “curse of dimensionality”. The current view is that distance concentration that is tendency of distances in high-dimensional data to become in discernible making distance-based methods label all points a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2020
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1624/4/042011